Ukrainian Banks’ Business Models Clustering: Application of Kohonen Neural Networks
نویسندگان
چکیده
منابع مشابه
Kohonen Networks and Clustering
The problem of color clustering is defined and shown to be a problem of assigning a large number (hundreds of thousands) of 3-vectors to a small number (256) of clusters. Finding those clusters in such a way that they best represent a full color image using only 256 distinct colors is a burdensome computational problem. In this paper, the problem is solved using "classical" techniques -k-means ...
متن کاملThe Application of Combined Fuzzy Clustering Model and Neural Networks to Measure Valuably of Bank Customers
Currently, acquisition of resources in banks is subject to attraction of the resources of banking customers. Meanwhile, the Bank’s valuable customers are one of the best resources to make profit for banks. Several different models are introduced for evaluation of profitability of the customers; but most of them are classical models and they are unable to evaluate the customers in complete and o...
متن کاملThe Application of Combined Fuzzy Clustering Model and Neural Networks to Measure Valuably of Bank Customers
Currently, acquisition of resources in banks is subject to attraction of the resources of banking customers. Meanwhile, the Bank’s valuable customers are one of the best resources to make profit for banks. Several different models are introduced for evaluation of profitability of the customers; but most of them are classical models and they are unable to evaluate the customers in complete and o...
متن کاملFuzzy Kohonen clustering networks for interval data
The Fuzzy Kohonen Clustering Network combines the idea of fuzzy membership values for learning rates. It is a kind of self-organizing fuzzy neural network that can show great superiority in processing the ambiguity and the uncertainty of data sets or images. Symbolic data analysis provides suitable tools for managing aggregated data described by intervals. This paper introduces Fuzzy Kohonen Cl...
متن کاملKohonen Networks and Clustering: Comparative Performance in Color Clustering
The problem of color clustering is defined and shown to be a problem of assigning a large number (hundreds of thousands) of 3-vectors to a small number (256) of clusters. Finding those clusters in such a way that they best represent a full color image using only 256 distinct colors is a burdensome computational problem. In this paper, the problem is solved using "classical" techniques -k-means ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Visnyk of the National Bank of Ukraine
سال: 2016
ISSN: 2414-987X,2414-987X
DOI: 10.26531/vnbu2016.238.013